A+A→∅model with a bias towards nearest neighbor

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nearest Neighbor Bias - A simple example

This is a short research note with an illustrative example describing the bias inherent in the nearest neighbor method.

متن کامل

Bias in nearest-neighbor hazard estimation

In nonparametric curve estimation, the smoothing parameter is critical for performance. In order to estimate the hazard rate, we compare nearest neighbor selectors that minimize the quadratic, the Kullback-Leibler, and the uniform loss. These measures result in a rule of thumb, a cross-validation, and a plug-in selector. A Monte Carlo simulation within the three-parameter exponentiated Weibull ...

متن کامل

Review of: Nearest Neighbor Bias - A simple example

As an aside, I spent about 6 months trying to devise a weighting scheme in high dimensions to eliminate bias when census of pixel predictions are directly summed into a population estimate. I tried various ways to tesselate feature space around each reference plot. I tried various nonlinear methods to warp feature space, including a rank score. I finally gave up. I hope someone can figure out h...

متن کامل

Towards Optimal Naive Bayes Nearest Neighbor

Naive Bayes Nearest Neighbor (NBNN) is a feature-based image classifier that achieves impressive degree of accuracy [1] by exploiting ‘Image-toClass’ distances and by avoiding quantization of local image descriptors. It is based on the hypothesis that each local descriptor is drawn from a class-dependent probability measure. The density of the latter is estimated by the non-parametric kernel es...

متن کامل

Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph

We introduce a new nearest neighbor search algorithm. The algorithm builds a nearest neighbor graph in an offline phase and when queried with a new point, performs hill-climbing starting from a randomly sampled node of the graph. We provide theoretical guarantees for the accuracy and the computational complexity and empirically show the effectiveness of this algorithm.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2015

ISSN: 1539-3755,1550-2376

DOI: 10.1103/physreve.92.012109